Coding-Based Oblivious Transfer
نویسندگان
چکیده
We present protocols for two flavors of oblivious transfer (OT): the Rabin and 1-out-of-2 OT based on the assumptions related to security of the McEliece cryptosystem and two zero-knowledge identification (ZKID) schemes, Stern’s from Crypto ’93 and Shamir’s from Crypto ’89, which are based on syndrome decoding and permuted kernels, respectively. This is a step towards diversifying computational assumptions on which OT – cryptographic primitive of central importance – can be
منابع مشابه
Quantum oblivious transfer and bit commitment protocols based on two non-orthogonal states coding
Oblivious transfer protocols (R-OT and OT1) are presented based on nonorthogonal states transmission, and the bit commitment protocols on the top of OT1 are constructed. Although these OT protocols are all unconditional secure, the bit commitment protocols based on OT protocols are not secure against attack similar to that presented by no-go theorem.
متن کاملUnconditionally Secure Oblivious Transfer Based on Channel Delays
Without the use of computational assumptions uncondition ally secure oblivious transfer OT is impossible in the standard model where the parties are using a clear channel Such impossibilities can be overcome by using a noisy channel Recently Palmieri and Pereira pro posed a protocol based on random channel delays only Their scheme is secure in the semi honest model but not in the general malici...
متن کاملOblivious Cocktail Watermarking by Sparse Code Shrinkage: A Regional- and Global-Based Scheme
Watermarking with oblivious detection and high robustness capabilities together is still a challenging problem up to now. The existing methods are either robust or oblivious but it is diicult to achieve both goals simultaneously. In this paper, oblivious detection is formulated as a blind source separation problem by regarding the hidden watermarks as noises. To keep high robustness, our non-ob...
متن کاملTowards Secure Two-Party Computation from the Wire-Tap Channel
We introduce a new protocol for secure two-party computation of linear functions in the semi-honest model, based on coding techniques. We first establish a parallel between the second version of the wire-tap channel model and secure two-party computation. This leads us to our protocol, that combines linear coset coding and oblivious transfer techniques. Our construction requires the use of bina...
متن کاملA Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM
Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of applications, in particular, as an essential building block for two-party and multi-party computation. We construct a round-optimal (2 rounds) universally composable (UC) protocol for oblivious transfer secure against active adaptive adversaries from any OW-CPA secure public-key encryption scheme with certain...
متن کامل